The Lattice-Theoretic Essence of Property Directed Reachability Analysis
نویسندگان
چکیده
Abstract We present LT-PDR , a lattice-theoretic generalization of Bradley’s property directed reachability analysis (PDR) algorithm. identifies the essence PDR to be an ingenious combination verification and refutation attempts based on Knaster–Tarski Kleene theorems. introduce four concrete instances LT-PDR, derive their implementation from generic Haskell experimentally evaluate them. also categorical structural theory that derives these instances.
منابع مشابه
Generalized Property Directed Reachability
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very successfully to hardware model checking. We provide a specification of the algorithm using an abstract transition system and highlight its dual operation: model search and conflict resolution. We then generalize it along two dimensions. Along one dimension we address nonli...
متن کاملInterpolating Property Directed Reachability
Current SAT-based Model Checking is based on two major approaches: Interpolation-based (Imc) (global, with unrollings) and Property Directed Reachability/IC3 (Pdr) (local, without unrollings). Imc generates candidate invariants using interpolation over an unrolling of a system, without putting any restrictions on the SAT-solver’s search. Pdr generates candidate invariants by a local search over...
متن کاملProperty Directed Reachability for Automated Planning
Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented transition systems. While originally conceived as a model checking algorithm for hardware circuits, it has already been successfully applied in several other areas. This paper is the first investigation of PDR from the perspective of automated planning. Similarly to the p...
متن کاملProgram Verification with Property Directed Reachability
Program Verification with Property Directed Reachability by Tobias Welp Doctor of Philosophy in Engineering–Electrical Engineering and Computer Sciences University of California, Berkeley Professor Andreas Kuehlmann, Chair As a consequence of the increasing use of software in safety-critical systems and the considerable risk associated with their failure, effective and efficient algorithms for ...
متن کاملDiagnosing Unreachable States Using Property-Directed Reachability
Probabilistic software analysis aims at quantifying how likely a target event is to occur, given a probabilistic characterization of the behavior of a program or of its execution environment. Examples of target events may include an uncaught exception, the invocation of a certain method, or the access to confidential information.We are working on a symbolic execution approach to probabilistic s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-13185-1_12